Inclusion matrices and chains

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inclusion matrices and chains

Given integers t , k, and v such that 0 t k v, let Wtk(v) be the inclusion matrix of t-subsets vs. k-subsets of a v-set. We modify slightly the concept of standard tableau to study the notion of rank of a finite set of positive integers which was introduced by Frankl. Utilizing this, a decomposition of the poset 2[v] into symmetric skipless chains is given. Based on this decomposition, we const...

متن کامل

Inclusion Matrices and the MDS Conjecture

Let Fq be a finite field of order q with characteristic p. An arc in Fq is an ordered family of at least k vectors in which every subfamily of size k is a basis of Fq . The MDS conjecture, which was posed by Segre in 1955, states that if k 6 q, then an arc in Fq has size at most q + 1, unless q is even and k = 3 or k = q − 1, in which case it has size at most q + 2. We propose a conjecture whic...

متن کامل

Transition Effect Matrices and Quantum Markov Chains

A transition effect matrix (TEM) is a quantum generalization of a classical stochastic matrix. By employing a TEM we obtain a quantum generalization of a classical Markov chain. We first discuss state and operator dynamics for a quantum Markov chain. We then consider various types of TEMs and vector states. In particular, we study invariant, equilibrium and singular vector states and investigat...

متن کامل

Modular Ranks of Geometric Inclusion Matrices

We survey recent results on p-ranks of certain inclusion matrices arising from a finite projective space or a finite symplectic space. 2000 Mathematics Subject Classification: 05E20, 20G05, 20C33.

متن کامل

Exit Frequency Matrices for Finite Markov Chains

Consider a finite irreducible Markov chain on state space S with transition matrix M and stationary distribution π. Let R be the diagonal matrix of return times, Rii = 1/πi. Given distributions σ, τ and k ∈ S, the exit frequency xk(σ, τ) denotes the expected number of times a random walk exits state k before an optimal stopping rule from σ to τ halts the walk. For a target distribution τ , we d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2008

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2007.09.002